Performance aspects of dynamic re-allocation for partitioned data
نویسندگان
چکیده
The correct and e cient management of data in distributed databases or mobile computing environments is di cult. Communication disruptions within such systems render the execution of database transactions problematic due to di culties in atomic commitment strategies. A previously proposed non-traditional system for data and operators, with single site transaction executions and decentralized commitment [9], is useful in speci c applications. For this approach, we use some simple analytical and simulation models to assess performance, and provide our ndings for straightforward demanddriven and periodic re-allocation strategies.
منابع مشابه
Semi-Partitioned Scheduling of Dynamic Real-Time Workload: A Practical Approach Based on Analysis-Driven Load Balancing
Recent work showed that semi-partitioned scheduling can achieve near-optimal schedulability performance, is simpler to implement compared to global scheduling, and less heavier in terms of runtime overhead, thus resulting in an excellent choice for implementing real-world systems. However, semi-partitioned scheduling typically leverages an off-line design to allocate tasks across the available ...
متن کاملResource re-allocation at network units by using of bi-level data envelopment analysis
The lack of renewable primary resources is one of the most serious challenges in recent decades. So under this circumstance, managers are looking for appropriate solutions for the optimal use of these resources to improve the efficiency of the under management units. One of the most widely used techniques in finding the optimal resource is data envelopment analysis (DEA). So in this paper, in ...
متن کاملDynamic Partitioning of Large Multicomputer Systems
We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.
متن کاملLightweight Performance Forecasts for Buffer Algorithms
Buffer memory allocation is one of the most important, but also one of the most difficult tasks of database system administration. Typically, database management systems use several buffers simultaneously for various reasons, e.g., disk speed, page size, access behavior. As a result, available main memory is partitioned among all buffers within the system to suit the expected workload, which is...
متن کاملA Performance Characterization of Load Balancing Algorithms for Parallel SAMR Applications
We perform a comprehensive performance characterization of load balancing algorithms for parallel structured adaptive mesh refinement (SAMR) applications. Using SAMR, computational resources are dynamically concentrated to areas in need of a high accuracy. Because of the dynamic resource allocation, the workload must repeatedly be partitioned and distributed over the processors. For an efficien...
متن کامل